Interactive continuous collision detection for non-convex polyhedra
نویسندگان
چکیده
منابع مشابه
A Local Collision Avoidance Method for Non-strictly Convex Polyhedra
This paper proposes a local collision avoidance method for non-strictly convex polyhedra with continuous velocities. The main contribution of the method is that non-strictly convex polyhedra can be used as geometric models of the robot and the environment without any approximation. The problem of the continuous interaction generation between polyhedra is reduced to the continuous constraints ge...
متن کاملCollision Detection of Convex Polyhedra Based on Duality Transformation
Collision detection is an essential problem in many applications in computer graphics, CAD/CAM, and robotics. In this paper, a new method, called CD-Dual, for detecting collision between two convex polyhedra is proposed. The idea is based on a local search among the faces on the Minkowski difference (M) of the polyhedra. The local search is guided by a simple signed distance function defined on...
متن کاملContinuous Blooming of Convex Polyhedra
We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.
متن کاملcient collision detection for moving polyhedra
In this paper we consider the following problem given two general polyhedra of complexity n one of which is moving translationally or rotating about a xed axis determine the rst collision if any between them We present an algorithm with running time O n for the case of translational movements and running time O n for rotational movements where is an arbitrary positive constant This is the rst k...
متن کاملA Rigidity Criterion for Non-Convex Polyhedra
Let P be a (non necessarily convex) embedded polyhedron in R, with its vertices on an ellipsoid. Suppose that the interior of P can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, · · · , Cn with disjoint interiors, whose vertices are the vertices of P . Su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Visual Computer
سال: 2006
ISSN: 0178-2789,1432-2315
DOI: 10.1007/s00371-006-0060-0